Maximum Codes with the Identifiable Parent Property
نویسنده
چکیده
To my parents, my brothers and my husband. iii ACKNOWLEDGEMENTS There are many I would like to thank for helping me get this far. First and foremost are my family who carried the burden of supporting my study all these years. I thank them for their constant encouragement, loyal support, endless love, and for teaching me to take pride in myself. I will always be grateful for everything they have done for me. I would like to express my special thanks to my advisor, Professor Xingxing Yu, for his great support and advice throughout my years at Georgia Tech. He has consistently provided me with freedom and encouragement whenever I needed it, and for this, I will always be indebted to him. I owe much thanks to Professor Ye (Geoffrey) Li in the School of Electrical and Computer Engineering at Georgia Tech. Over the last five years his professional advice during our weekly meetings on Telecommunication and Signal Processing has been invaluable. Hongjian Lai, made it possible for me to come to Georgia Tech. All of the faculty who taught me mathematics deserve thanks. In particular I would like to the pleasure to work with and opportunity to learn from. I thank Ms. Cathy Jacobson for her great help with my English. She was always available whenever I needed help. I will miss her. I thank Ms. Rena Brakebill for her great support in my teaching; she always tried to accommodate my course and schedule requests.
منابع مشابه
On optimal codes with w-identifiable parent property
Let C be a q-ary code of length n and X ⊆ C, then d is called a descendant of X if di ∈ {xi : x ∈ X} for all 1 ≤ i ≤ n. C is said to be a w-identifiable parent property code (w-IPP code for short) if whenever d is a descendant of w (or fewer) codewords, one can always identify at least one of the parent codewords in C. In this paper, we give constructions for w-IPP codes of length w + 1. Furthe...
متن کاملCodes with the Identifiable Parent Property and the Multiple-Access Channel
I. The identifiable parent property and some first results about it If C is a q–ary code of length n and a and b are two codewords, then c is called a descendant of a and b if ct ∈ {at, bt} for t = 1, . . . , n. We are interested in codes C with the property that, given any descendant c, one can always identify at least one of the ‘parent’ codewords in C. We study bounds on F (n, q), the maxima...
متن کاملOn Codes with the Identifiable Parent Property
If C is a q-ary code of length n and a and b are two codewords, then c is called a descendant of a and b if ci 2 fai; big for i = 1; : : : ; n. We are interested in codes C with the property that, given any descendant c, one can always identify at least one of the `parent' codewords in C. We study bounds on F (n; q), the maximal cardinality of a code C with this property, which we call the iden...
متن کاملOn Collusion Security of Random Codes
Fingerprinting is a technique to add identifying marks to each copy of digital contents in order to enhance traceability to a distribution system. Collusion attacks, in which the attackers collect two or more fingerprinted copies and try to generate an untraceable copy, are considered to be a threat for the fingerprinting system. With the aim of enhancing collusion security to the fingerprintin...
متن کاملCodes with the identifiable parent property for multimedia fingerprinting
Let C be a q-ary code of length n and size M , and C(i) = {c(i) | c = (c(1), c(2), . . . , c(n)) ∈ C} be the set of ith coordinates of C. The descendant code of a sub-code C ′ ⊆ C is defined to be C ′ (1) × C ′ (2) × · · · × C ′ (n). In this paper, we introduce a multimedia analogue of codes with the identifiable parent property (IPP), called multimedia IPP codes or t-MIPPC(n,M, q), so that giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006